ACAEP: A CLP based tool for Job Sequencing

Through times scheduling and planning became more and more important among production issues. A good scheduling application should be exible enough to allow a perfect representation of the problems and a interactive search of its solutions. At the same time it should be capable of solve them independently in a eecient way. In this paper we present an application devoted to the resolution of a real Job Sequencing Problem. For that we show how the problem can be expressed concisely and declaratively in a CLP system like ECL i PS e. We also present some labeling procedures and a comparison of the corresponding results.